template <class T>
class queue {
private:
	T store[100];
	int head, tail;

public:
	queue(): head(0), tail(0) {}

	void push(T x) {
		store[tail] = x;
		tail++;
	}
	
	T pop() {
		T x = store[head];
		head++;
		return x;
	}

	bool empty() {
		return head == tail;
	}
};